Canonical double covers of circulants
نویسندگان
چکیده
The canonical double cover $B(X)$ of a graph $X$ is the direct product and $K_2$. If $Aut(B(X)) \cong Aut(X) \times \mathbb{Z}_2$ then called stable; otherwise unstable. An unstable nontrivially if it connected, non-bipartite distinct vertices have different neighborhoods. Circulant Cayley on cyclic group. Qin et al. conjectured in [J. Combin. Theory Ser. B 136 (2019), 154-169] that there are no nontrivialy circulants odd order. In this paper we prove conjecture.
منابع مشابه
Abelian Covers and Isotrivial Canonical Fibrations
We give a pure algebraic method to construct all the infinite families of surfaces S with isotrivial canonical fibration where S is the minimal desingularization of X = Z/G and G is an Abelian group acting diagonally on the product of two smooth curves: Z = F ×D. In particular we recover all the known infinite families of surfaces with isotrivial canonical fibration and we produce many new ones...
متن کاملDensity Doubling, Double-circulants, and New Sphere Packings
New nonlattice sphere packings in dimensions 20, 22, and 44–47 that are denser than the best previously known sphere packings were recently discovered. We extend these results, showing that the density of many sphere packings in dimensions just below a power of 2 can be doubled using orthogonal binary codes. This produces new dense sphere packings in Rn for n = 25, 26, . . . , 31 and 55, 56, . ...
متن کاملFlows, flow-pair covers and cycle double covers
In this paper, some earlier results by Fleischner [H. Fleischner, Bipartizing matchings and Sabidussi’s compatibility conjecture, DiscreteMath. 244 (2002) 77–82] about edge-disjoint bipartizingmatchings of a cubic graphwith a dominating circuit are generalized for graphs without the assumption of the existence of a dominating circuit and 3-regularity. A pair of integer flows (D, f1) and (D, f2)...
متن کاملSuborthogonal double covers of complete graphs
A family G of isomorphic copies of a given graph G is said to be a suborthogonal double cover (SODC) of the complete graph K n by G, if every edge of K n belongs to exactly two members of G and any two diierent elements from G share at most one edge. We introduce the notion of an SODC as a generalization of the well-known concept of orthogonal double covers. Our objective is to investigate the ...
متن کاملOrthogonal double covers of complete bipartite graphs
Let H = {A1, . . . , An, B1, . . . , Bn} be a collection of 2n subgraphs of the complete bipartite graph Kn,n. The collection H is called an orthogonal double cover (ODC) of Kn,n if each edge of Kn,n occurs in exactly two of the graphs in H; E(Ai) ∩ E(Aj) = φ = E(Bi) ∩ E(Bj) for every i, j ∈ {1, . . . , n} with i = j, and for any i, j ∈ {1, . . . , n}, |E(Ai)∩E(Bj)| = 1. If Ai ∼= G ∼= Bi for al...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorial Theory, Series B
سال: 2022
ISSN: ['0095-8956', '1096-0902']
DOI: https://doi.org/10.1016/j.jctb.2021.12.005